graph partition造句
例句与造句
- A problem on the computational complexity of graph partitions
关于图划分中的一个计算复杂性问题 - For more on improving sparse matrix algorithms , read fast and effective algorithms for graph partitioning and sparse - matrix ordering
如果您想了解更多关于提高稀疏矩阵算法的信息，请阅读 - With the help of metis , which is a software package in static graph partitioning , we construct a type of block jacobi preconditioner
J时十u个1任用问题，分别用该分解作近似川j i ’ d寸十八’ 。 - Experiments show that the new optimized partition algorithm can improve the parallel simulation performance compared with the ones partitioned by traditional graph partition algorithms
实验表明,该优化划分方法相对于传统的图划分算法能够有效地提高模拟性能。 - We have studied how to distill a connection matrix between two nodes in a generalized switched network ; using tarjan ’ s graph partition algorithm and nonseparable two - terminal graph concept , we proposed an effective algorithm
对从广义开关网络中提取出两点间连接矩阵的方法进行了研究,利用tarjan的拓扑图块划分算法、开关网络中的不可分二端图概念等设计了较有效的算法。 - It's difficult to find graph partition in a sentence. 用graph partition造句挺难的
- One of the main problems in pdes is how to partition the network simulation workload to decrease the time needed to complete the simulation and improve performance of simulation . here a new optimized partition algorithm was put forward , which first analyses the performance factors of parallel simulation and then constructs a performance estimation model for partition ; based on this model , it mends the graph partition algorithm to consider all factors , including simulation applications and simulation environments . optimized factors are workload balance 、 communication cost and time window of lookhead
鉴于基于传统图划分算法的任务划分工具存在诸多不足,本文提出了并行网络模拟任务的优化划分方法,其思想是:首先从pdes机制出发,分析影响并行网络模拟性能的各种因素并建立一个能够综合考虑各种因素的并行网络模拟性能估计模型;其次,改进多级图划分算法,使得算法具有综合考虑模拟应用与模拟运行环境,同时在优化过程中使用性能估计模型指导划分,实现对影响并行网络模拟性能的三个因素(包括负载均衡、通信开销、安全时间窗口长度)的优化能力;最后,结合并行网络模拟性能估计模型与改进的多极图划分算法,实现了并行网络模拟任务的优化划分。 - Some crucial design principles , methods and techniques in petsc are highlighted . propose a general scheme for the parallelization of an unstructured mesh , including graph partitioning , data division and mesh managing , based on message passing programming style . propose a series of comprehensive considerations about how to achieve a well - designed , object - oriented and data - distributed parallel software
?从软件外在的功能组织、使用模式与内在的设计思想、实现技术及其因果关联性等多重角度出发，对petsc做了深入的分析探讨，尤其从源代码的层次，重点剖析了petsc的面向对象、中性数据结构、上下文环境、并行设计与通信等重要核心技术的实现方法及其对petsc使用模式和性能所产生的意义。 - The basis is hierarchical placement based on the model of directed graph partition . introducing timing - driven placement to clustering , it is an excellent method that mixes the characteristics of timing - driven placement , clustering and directed graph partition . integrated with cdp , this algorithm can solve the system - level vfg problems of electronic devices
该算法是基于有向图分解模型的分级布局算法，将定时驱动布局思想引入结群过程，是集定时驱动布局、基于结群的布局、基于划分的布局和有向图分解思想为一体的快速布局算法。